Boolean Ultrapowers, the Bukovský-dehornoy Phenomenon, and Iterated Ultrapowers

نویسنده

  • GUNTER FUCHS
چکیده

We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a generalization of Př́ıkrý forcing as examples. We refer to the discovery that the intersection of the finite iterates of the universe by a normal measure is the same as the generic extension of the direct limit model by the critical sequence as the Bukovský-Dehornoy phenomenon, and we develop a sufficient criterion (the existence of a simple skeleton) for when a version of this phenomenon holds in the context of Boolean ultrapowers. Assuming that the canonical generic filter over the Boolean ultrapower model has what we call a continuous representation, we show that the Boolean model consists precisely of those members of the intersection model that have continuously and eventually uniformly represented codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Prikry forcing and iteration of generic ultrapowers

Moreover Bukovský [1] and Dehornoy [2] showed that the generic extension Mω[〈j0,n(κ) | n ∈ ω〉] is ⋂ n∈ω Mn in Theorem 1.1. (For the history of these results, read the introduction of Dehornoy [2] and pp.259-260 of Kanamori [6]. ) In Dehornoy [3], these results were generalized for the forcing of Magidor [7] which changes a measurable cardinal of higher Mitchell order into a singular cardinal of...

متن کامل

From Creature Forcing to Boolean Ultrapowers

We will consider four cardinal characteristics of the continuum, a, b, d, s and discuss how their study has prompted the development of some of the most powerful forcing techniques: creature forcing, coherent systems of iterations, Shelah’s method of template iterations and the method of boolean ultrapowers.

متن کامل

Some Applications of ~terated Ultrapowers in Set Theory

Let 91 be a ~-complete ultrafilter on the measurable cardinal ~. Scott [ 1 3 ] proved V ¢ L by using 91 to take the ultrapower of V. Gaifman [ 2] considered iterated ultrapowers of V by cg to conclude even stronger results; for example, that L n ~(6o) is count-able. In this paper we discuss some new applications of iterated ultra-powers. In § § 1-4, we develop a straightforward generalization o...

متن کامل

Representation of MV-algebras by regular ultrapowers of [0, 1]

We present a uniform version of Di Nola Theorem, this enables to embed all MV-algebras of a bounded cardinality in an algebra of functions with values in a single non-standard ultrapower of the real interval [0, 1]. This result also implies the existence, for any cardinal α, of a single MValgebra in which all infinite MV-algebras of cardinality at most α embed. Recasting the above construction ...

متن کامل

A Dichotomy for the Number of Ultrapowers

We prove a strong dichotomy for the number of ultrapowers of a given model of cardinality ≤ 2א0 associated with nonprincipal ultrafilters on N. They are either all isomorphic, or else there are 2 א0 many nonisomorphic ultrapowers. We prove the analogous result for metric structures, including C*-algebras and II1 factors, as well as their relative commutants and include several applications. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017